The Barycenter Heuristic and the Reorderable Matrix

نویسندگان

  • Erkki Mäkinen
  • Harri Siirtola
چکیده

Bertin’s reorderable matrix (Bertin 1981, 1983, 2001) is a simple visualization method for exploring tabular data. The basic idea is to transform a multidimensional data set into a 2D interactive graphic. The graphical presentation of a data set contains rows and columns which can be permuted, allowing different views of the data set. The actual data values are replaced with symbols, say circles or rectangles, that have a size relative to the actual data value. Processing the reorderable matrix involves bringing together similar rows and columns. The reorderable matrix suits well in application areas which call for human expertise to guide the automatic process, as in architecture (Adams & Daru, 1994; Veenendaal, 1994) and system analysis and project management (Ulrich & Eppinger, 1999) where the knowledge is difficult to transform into a form “understandable” for computers. When using the reorderable matrix, the manual and automatic phases for reordering the matrix take turns and support each others. Hence, the human knowledge guides the systems but the dull parts are left to computer. There are some known implementations for automatic reordering of the reorderable matrix, most notably those published by people from the Eindhoven University of Technology (see Daru & Adams, 1989; Snijder, 1994; Veenendaal, 1994), and those used in the connection with engineering data management. Experimental implementations of the reorderable matrix are reported by Lohringer (1995), Rao & Card (1994) and Schmid & Hinterberger (1994). All these are far too inefficient to be useful in an interactive tool. The purpose of this paper is to discuss the role of the barycenter heuristic in ordering the rows and columns of the matrix. So far, the barycenter heuristic has been mainly used in graph drawing algorithms. In order to gain full advantage of the barycenter heuristic in ordering rows and columns of the reorderable matrix, we survey its use in various contexts and recall the theoretical results obtained.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing and reconstructing the reorderable matrix

Received: 10 February 2004 Revised: 13 August 2004 Accepted: 28 September 2004 Online publication date: 3 February 2005 Abstract We consider the backgrounds, applications, implementations, and user interfaces of the reorderable matrix originally introduced by Jacques Bertin. As a new tool for handling the matrix, we propose a new kind of interface for interactive cluster analysis. As the main t...

متن کامل

Reordering the Reorderable Matrix as an Algorithmic Problem

The Reorderable Matrix is a visualization method for tabular data. This paper deals with the algorithmic problems related to ordering the rows and columns in a Reorderable Matrix. We establish links between ordering the matrix and the well-known and much studied problem of drawing graphs. First, we show that, as in graph drawing, our problem allows different aesthetic criterions which reduce to...

متن کامل

Interaction with the Reorderable Matrix

The Reorderable Matrix is a simple visualization method for quantitative tabular data. This paper examines how first-time users interact with the Reorderable Matrix and how well they perform a simple task of finding correlating attributes. Visualizing a set of data is a common task in various activities such as decision-making or opinion-forming. Typical situations are a person making business-...

متن کامل

A Conjecture on the Error Bound of the Barycenter Heuristic

We reconsider the error bound calculations of the barycenter heuristic for drawing bipartite graphs with as few edge crossings as possible. We conjecture that, contrary to earlier results, the relative error done by the barycenter heuristic is bounded, provided that some natural assumptions are made. This result would explain why the barycenter heuristic performs so well in practice.

متن کامل

New bounds on the barycenter heuristic for bipartite graph drawing

The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad as Ω( √ n) times the optimum, where n is the number of nodes in the graph. However, the example used in the proof has many isolated nodes. Mäkinen [10] conjectured that a better performance ratio is possible if isolate...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Informatica (Slovenia)

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2005